About the one multiagent optimization problem in positional games
نویسندگان
چکیده
منابع مشابه
About One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملThe Angel Problem, Positional Games, and Digraph Roots
Preface This thesis is about combinatorial games—mostly. It is also about graphs, directed graphs and hypergraphs, to a large extent; and it deals with the complexity of certain computational problems from these two areas. We study three different problems that share several of the above aspects, yet, they form three individual subjects and so we treat them independently in three self-contained...
متن کاملPositional Games
Course number: 0366.4991. Course webpage: www.math.tau.ac.il/∼krivelev/teaching/PosGames/PG.html When and where: Wednesdays 15-18, Schreiber 007 Prospective audience: the course is intended for graduate and advanced undergraduate students in Mathematics and Computer Science. Informal prerequisites: working knowledge of graph theory notions; knowledge of basic concepts in probability. Grading: H...
متن کاملCooperative Games in MultiAgent Systems
In both human and artificial societies some activities are only allowed to coalitions that satisfy certain criteria, e.g., to sufficiently large coalitions or coalitions which involve players of sufficient seniority. Simmons (1988) formalised this idea in the context of secret sharing schemes by defining the concept of a (disjunctive) hierarchical access structure. The mathematical concept whic...
متن کاملMultiagent Chess Games
A Multiagent Chess playing paradigm is defined. By defining spheres and strength degrees for pieces winning strategies on games can be defined. The new Intelligent Tree Computing theories we have defined since 1994 can be applied to present precise strategies and prove theorems on games. The multiagent chess game model is defined by an isomorphism on multiboards and agents. Intelligent game tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Keldysh Institute Preprints
سال: 2017
ISSN: 2071-2898,2071-2901
DOI: 10.20948/prepr-2017-146